import java.util.*;

public class 第12届省赛B {
    static long[] dp = new long[98090000];
    static Scanner scanner=new Scanner(System.in);
    static long minD=Long.MAX_VALUE;
    static long[] arr=new long[16];
    static long sum=0;
    public static void main(String[] args) {
        c();
    }


    /** 口罩分配 **/
    static void DFS(int index,long now){
                if(index==15) {
                    minD=Math.min(minD, Math.abs(sum-2*now));//A,B两个医院差了多少口罩
                }
                else {
                    DFS(index+1, now+arr[index]);//派给A
                    DFS(index+1, now);//不派给A
                }
        }
//    for(int i=0;i<15;i++) {
//           arr[i]=scanner.nextLong();
//           sum+=arr[i]; //记录总共的口罩数
//       }
//       DFS(0,0);
//           System.out.println(minD);

    /** 卡片 **/
    static void b(){
        int[]a=new int[10];
        for (int i = 0; i <10 ; i++) {
            a[i]=2021;
        }

        for (int i = 1; i <10000 ; i++) {
            String s = String.valueOf(i);
            char[] temp = s.toCharArray();
            for (int j = 0; j <temp.length ; j++) {
                int k = Integer.parseInt(temp[j]+"");
                a[k]=a[k]-1;
                if (a[k]<0) {
                    System.out.println(i - 1);
                }
            }
        }




    }

    /** 直线 **/
    static double max = Double.POSITIVE_INFINITY;
    static double min = Double.NEGATIVE_INFINITY;
    static class Temp{
        double k;
        double b;

        public Temp(double k, double b) {
            this.k = k;
            this.b= b;
        }
    }
    static void c(){
        List<Temp> list = new ArrayList();
        for (int i = 0; i <20 ; i++) {
            for (int j = 0; j <21 ; j++) {
                for (int l = 0; l <20 ; l++) {
                    for (int m = 0; m <21 ; m++) {
                        if (i!=l||j!=m){
                             double k = ((double)j-(double)m)/((double)i-(double)l);
                             double b = 0;
                             if (i-l==0){b = i;}
                             else b = (double)j-k*(double)i;
                             boolean f = true;
                             if (list.size()!=0) {
                                 for (Temp temp1 : list) {
                                     if (temp1.k == k && temp1.b == b) {
                                         f = false;
                                     }
                                 }
                             }

                             if (f){
                                Temp temp = new Temp(k,b);
                                 System.out.println(k+" "+b);
                                list.add(temp);
                             }
                        }
                    }
                }

            }
        }
        System.out.println(list.size());
    }
    }
